Research on Taxiway Path Optimization Based on Conflict Detection
نویسندگان
چکیده
منابع مشابه
Research on Taxiway Path Optimization Based on Conflict Detection
Taxiway path planning is one of the effective measures to make full use of the airport resources, and the optimized paths can ensure the safety of the aircraft during the sliding process. In this paper, the taxiway path planning based on conflict detection is considered. Specific steps are shown as follows: firstly, make an improvement on A * algorithm, the conflict detection strategy is added ...
متن کاملmortality forecasting based on lee-carter model
over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...
15 صفحه اولResearch on the Optimization and Simulation of the Shortest Path Based on Algorithm of Dijkstra
Dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional Dijkstra algorithm, on account of the insufficiency of this algorithm in path optimization, this paper uses adjacency list and circular linked list with combination to store date, and through the improv...
متن کاملOptimization of Taxiway Traversal at Congested Airports
Airport runways and taxiways have been identified as a key source of system-wide congestion and delay in the over-strained commercial air traffic system. To combat this growing problem, we present a novel approach for taxiway scheduling and traversal. Aircraft must traverse a taxiway, represented by a graph, from gates to their respective runways and arrive at their scheduled times while adheri...
متن کاملRWA Based on Approximated Path Conflict Graphs in Optical Networks
Among many solutions to Routing and Wavelength Assignment (RWA) problems based on Edge Disjoint Paths (EDP), the Path Conflict Graph (PCG) algorithm shows outstanding performance in terms of wavelength. In this paper, we improve the PCG algorithm by imposing limitations on the EDPs length based on the fact that the EDPs are longer than the average length for the rarely selected demands. We conc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2015
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0134522